Dynamic graph-based search in unknown environments
نویسندگان
چکیده
منابع مشابه
Dynamic graph-based search in unknown environments
A novel graph-based approach to search within unknown environments is presented. A virtual geometric structure is imposed upon the environment represented in memory by a graph. Algorithms use this representation to coordinate a team of robots (or entities). Local discovery of environment features causes dynamic expansion of the graph resulting in global exploration of the unknown environment. T...
متن کاملGraph Based Path Planning in Unknown Environments Using Voronoi Diagrams
This work presents a method for online path planning based on graph traversal for autonomous mobile systems. A method using the Voronoi diagrams of obstacle dense areas for efficient planning is proposed. This method creates collision free paths for the vehicle in a receding horizon fashion on a per time-step basis, for environments where no prior map data is available. Simulation results of th...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولSearch-based Planning for Large Dynamic Environments
Agents operating in the real world often have to act under the conditions where time is critical: there is a limit on the time they can afford to spend on deliberating what action to execute next. Planners used by such agents must produce the best plans they can find within the amount of time available. The strategy of always searching for an optimal plan becomes infeasible in these scenarios. ...
متن کاملSpace-time planning in unknown dynamic environments
Numerous path planning solutions have been proposed to solve the navigation problem in static environments, potentially populated with dynamic obstacles. However, in dynamic environments, moving objects can be used to reach new locations. In this paper, we propose an online planning algorithm for unknown dynamic environments that focuses on accessibility and on the use of objects movements to r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2012
ISSN: 1570-8667
DOI: 10.1016/j.jda.2011.06.004